翻訳と辞書
Words near each other
・ Circle of Tchaikovsky
・ Circle of the Oath
・ Circle of the Rhine
・ Circle of the Sun
・ Circle of Three
・ Circle of Two
・ Circle of Willis
・ Circle officer
・ Circle Oil
・ Circle on Cavill
・ Circle packing
・ Circle packing in a circle
・ Circle packing in a square
・ Circle packing in an equilateral triangle
・ Circle packing in an isosceles right triangle
Circle packing theorem
・ Circle Pines, Minnesota
・ Circle Ranch
・ Circle Records
・ Circle Records (Germany)
・ Circle Regenerated
・ Circle Repertory Company
・ Circle research
・ Circle Round the Sun
・ Circle route
・ Circle rules football
・ Circle Sanctuary
・ Circle Series
・ Circle Sky
・ Circle Slide


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Circle packing theorem : ウィキペディア英語版
Circle packing theorem

The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are disjoint. The intersection graph (sometimes called the tangency graph or contact graph) of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph. Coin graphs are always connected, simple, and planar. The circle packing theorem states that the converse also holds:
Circle packing theorem: For
every connected simple planar graph ''G'' there is a circle packing in the plane
whose intersection graph is (isomorphic to) ''G''.
==A uniqueness statement==
A graph ''G'' is ''triangulated planar'' if it is
planar and every connected component of the complement of the embedding of ''G'' in the sphere has precisely three edges on its boundary, or in other words, if ''G'' is the 1-skeleton of a simplicial complex which is homeomorphic to the sphere. Any triangulated planar graph ''G'' is connected and simple, so the circle packing theorem guarantees the existence of a circle packing whose intersection graph is (isomorphic to) ''G''. Such a ''G'' must also be finite, so its packing will have a finite number of circles. As the following theorem states more formally, every maximal planar graph can have at most one packing.
Koebe–Andreev–Thurston theorem: If ''G'' is a finite triangulated planar graph, then the circle packing whose tangency graph is (isomorphic to) ''G'' is unique, up to Möbius transformations and reflections in lines.
Thurston〔 observes that this uniqueness is a consequence of the Mostow rigidity theorem. The plane in which the circles are packed may be viewed as the boundary of a halfspace model for hyperbolic space; with this view, each circle is the boundary of a plane within the hyperbolic space. One can define a set of disjoint planes from the circles of the packing, and a second set of disjoint planes defined by the circles surrounding each triangular gap between three of the circles in the packing. These two sets of planes meet at right angles, and form the generators of a reflection group whose fundamental domain can be viewed as a hyperbolic manifold. By Mostow rigidity, the hyperbolic structure of this domain is uniquely determined, up to isometry of the hyperbolic space; these isometries, when viewed in terms of their actions on the Euclidean plane on the boundary of the half-plane model, translate to Möbius transformations.
There is also a more elementary proof based on the maximum principle and on the observation that, in the triangle connecting the centers of three mutually tangent circles, the
angle formed at the center of one of the circles is monotone decreasing in its radius and monotone increasing in the two other radii. Given two packings for the same graph ''G'', one may apply reflections and Möbius transformations to make the outer circles in these two packings correspond to each other and have the same radii. Then, let ''v'' be an interior vertex of ''G'' for which the circles in the two packings have sizes that are as far apart as possible: that is, choose ''v'' to maximize the ratio ''r''1/''r''2 of the radii of its circles in the two packings. For each triangular face of ''G'' containing ''v'', it follows that the angle at the center of the circle for ''v'' in the first packing is less than or equal to the angle in the second packing, with equality possible only when the other two circles forming the triangle have the same ratio ''r''1/''r''2 of radii in the two packings. But the sum of the angles of all of these triangles surrounding the center of the triangle must be 2π in both packings, so all neighboring vertices to ''v'' must have the same ratio as ''v'' itself. By applying the same argument to these other circles in turn, it follows that all circles in both packings have the same ratio. But the outer circles have been transformed to have ratio 1, so ''r''1/''r''2 = 1 and the two packings have identical radii for all circles.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Circle packing theorem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.